Supersaturation problem for color-critical graphs
نویسندگان
چکیده
منابع مشابه
Supersaturation problem for color-critical graphs
The Turán function ex(n, F ) of a graph F is the maximum number of edges in an F -free graph with n vertices. The classical results of Turán and Rademacher from 1941 led to the study of supersaturated graphs where the key question is to determine hF (n, q), the minimum number of copies of F that a graph with n vertices and ex(n, F ) + q edges can have. We determine hF (n, q) asymptotically when...
متن کاملOn complete subgraphs of color-critical graphs
A graph G is called k-critical if x(G) = k and x(G e) -C x(G) for each edge e of G, where x denotes the chromatic number. T. Gallai conjectured that every k-critical graph of order n contains at most n complete (k l)-subgraphs. In 1987, Stiebitz proved Gallai’s conjecture in the case k = 4, and in 1992 Abbott and Zhou proved Gallai’s conjecture for all k > 5. In their paper, Abbott and Zhou ask...
متن کاملLecture notes on sparse color-critical graphs
This text together with the attached paper [8] surveys results on color-critical graphs, with emphasis on sparse ones. The first two sections discuss the important contributions by Dirac and Gallai and present proofs of some remarkable results of them. The next two sections discuss the later progress and a number of applications of the recent results. We also use [8] for description of some app...
متن کاملCounting substructures I: color critical graphs
Let F be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of F in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits [10], who proved that there is one copy of F , and of Rademacher, Erdős [1, 2] and LovászSimonovits [4], who proved similar counting results when F is a complete g...
متن کاملColor-Critical Graphs Have Logarithmic Circumference
A graph G is k-critical if every proper subgraph of G is (k − 1)-colorable, but the graph G itself is not. We prove that every k-critical graph on n vertices has a cycle of length at least logn/(100 logk), improving a bound of Alon, Krivelevich and Seymour from 2000. Examples of Gallai from 1963 show that the bound cannot be improved to exceed 2(k − 1) logn/ log(k − 2). We thus settle the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2017
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2016.12.001